Cycle decompositions of the complete graph
نویسندگان
چکیده
For a positive integer n, let G be Kn if n is odd and Kn less a one-factor if n is even. In this paper it is shown that, for non-negative integers p, q and r, there is a decomposition of G into p 4-cycles, q 6-cycles and r 8-cycles if 4p+6q+8r = |E(G)|, q = 0 if n < 6 and r = 0 if n < 8.
منابع مشابه
Mixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...
متن کاملDecompositions of complete multipartite graphs via generalized graceful labelings
We prove the existence of infinite classes of cyclic Γ-decompositions of the complete multipartite graph, Γ being a caterpillar, a hairy cycle or a cycle. All results are obtained by the construction of d-divisible α-labelings of Γ, introduced in [A. Pasotti, On d-graceful labelings, Ars Combin. 111 (2013), 207–223] as a generalization of classical α-labelings. It is known that such labelings i...
متن کاملRemainder Cordial Labeling of Graphs
In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{...
متن کاملSome equitably 3-colorable cycle decompositions of Kv+I
Let G be a graph in which each vertex has been colored using one of k colors, say c1, c2, . . . , ck. If anm-cycle C inGhas ni vertices colored ci, i = 1, 2, . . . , k, and | ni−nj |≤ 1 for every i, j ∈ {1, 2, . . . , k}, then C is equitably k-colored. Anm-cycle decomposition C of a graph G is equitably k-colorable if the vertices of G can be colored so that everym-cycle in C is equitably k-col...
متن کاملThe metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ars Comb.
دوره 81 شماره
صفحات -
تاریخ انتشار 2006